Enhanced Ant Colony Based Algorithm for Routing in Mobile Ad Hoc Network
نویسنده
چکیده
Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not have fixed topology. This network does not have any infrastructure or central administration, hence it is called infrastructure-less network. The change in topology makes the route from source to destination as dynamic fixed and changes with respect to time. The nature of network requires the algorithm to perform route discovery, maintain route and detect failure along the path between two nodes [1]. This paper presents the enhancements of ARA [2] to improve the performance of routing algorithm. ARA [2] finds route between nodes in mobile ad-hoc network. The algorithm is on-demand source initiated routing algorithm. This is based on the principles of swarm intelligence. The algorithm is adaptive, scalable and favors load balancing. The improvements suggested in this paper are handling of loss ants and resource reservation. Keywords—Ad hoc networks, On-demand routing, Swarm intelligence.
منابع مشابه
A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks
The dynamic nature of mobile ad hoc networks makes it difficult to consider a specific model for their topology which might change in a short period of time. Using the knowledge about the location of nodes, several relatively efficient position based routing algorithms have been proposed but almost all of them are sensitive to the network topology. Ant colony optimization based routing algorith...
متن کاملAn Emerging Ant Colony Optimization Routing Algorithm (acora) for Manets
Ad hoc networks are characterized by multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. A mobile ad hoc network (Manet) is a collection of mobile nodes which communicate over radio. These kinds of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile a...
متن کاملANT COLONY OPTIMIZATION ROUTING to MOBILE AD HOC NETWORKS in URBAN ENVIRONMENTS
In this paper we present on-demand routing algorithm Enhanced Ant Colony Optimization (ACO) for Mobile ad-hoc networks(MANETs). Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, ef...
متن کاملBeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملAnt Colony based Routing for Mobile Ad-Hoc Networks towards Improved Quality of Services
Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteri...
متن کاملA Hybrid Multi-agent Routing Algorithm based on Ant Colony Optimization for MANET
There are many routing algorithms are presented for Mobile Ad hoc Network such as Destination sequenced Distance Vector (DSDV) which is known as proactive routing algorithm based on routing table, due to continuously updating routing tables, it consumes large portion of network capacity. Another is Ad hoc on Demand Distance Vector (AODV) is known as reactive algorithm. In this algorithm, when p...
متن کامل